Grotzsch problem

См. также в других словарях:

• Grötzsch graph — infobox graph name = Grötzsch graph namesake = Herbert Grötzsch vertices = 11 edges = 20 chromatic number = 4 chromatic index = girth = 4 properties = The Grötzsch graph is a triangle free graph with 11 vertices, 20 edges, and chromatic number 4 …   Wikipedia

• Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… …   Wikipedia

• Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

• Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

• Four color theorem — Example of a four colored map A four colori …   Wikipedia

• List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… …   Wikipedia

• Oswald Teichmüller — (* 18. Juni 1913 in Nordhausen; † wahrscheinlich September 1943 am Dnepr, Sowjetunion) war ein deutscher Mathematiker, der sich mit Funktionentheorie und Algebra beschäftigte. Inhaltsverzeichnis 1 Leben 2 Zitat …   Deutsch Wikipedia

• Chvátal graph — Named after Václav Chvátal Vertices 12 Edges 24 …   Wikipedia